Bidirectional Natural Deduction
نویسنده
چکیده
The goal of this paper is to present a theorem prover able to perform both forward and backward reasoning supported by a well deened formal system. This system for bidirectional reasoning has been proved equivalent to Gentzen's classical system of propositional natural deduction. This paper, primarily aimed at developing a deeper theoretical understanding of bidirectional reasoning, provides basic concepts to be incorporated into an innovative theorem prover to support interactive proofs construction in general domains.
منابع مشابه
Determining Semantic Textual Similarity using Natural Deduction Proofs
Determining semantic textual similarity is a core research subject in natural language processing. Since vector-based models for sentence representation often use shallow information, capturing accurate semantics is difficult. By contrast, logical semantic representations capture deeper levels of sentence semantics, but their symbolic nature does not offer graded notions of textual similarity. ...
متن کاملA Bidirectional Model For Natural Language Processing
In this paper* I will argue for a model of grammatical processing that is based on uniform processing and knowledge sources. The main feature of this model is to view parsing and generation as two strongly interleaved tasks performed by a single parametrized deduction process. It will be shown that this view supports flexible and efficient natural language processing.
متن کاملCommuting Conversions vs. the Standard Conversions of the "Good" Connectives
Commuting conversions were introduced in the natural deduction calculus as ad hoc devices for the purpose of guaranteeing the subformula property in normal proofs. In a well known book, Jean-Yves Girard commented harshly on these conversions, saying that ‘one tends to think that natural deduction should be modified to correct such atrocities.’ We present an embedding of the intuitionistic predi...
متن کاملProofs, Upside Down - A Functional Correspondence between Natural Deduction and the Sequent Calculus
It is well known in proof theory that sequent-calculus proofs differ from natural deduction proofs by “reversing” elimination rules upside down into left introduction rules. It is also well known that to each recursive, functional program corresponds an equivalent iterative, accumulator-passing program, where the accumulator stores the continuation of the iteration, in “reversed” order. Here, w...
متن کاملCompiling Systemic Grammar into Feature Logicsystems 1
Although systemic grammars are represented declaratively (as system networks), the most important implementations to date have been committed to the generation direction , and seem more or less incomprehensible for the researcher not familiar with systemic descriptions and software. The aim of this paper is, therefore, to re-represent systemic grammar resources in a standard typed feature logic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993